Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое term rewriting system - определение

REPLACING SUBTERM IN A FORMULA WITH ANOTHER TERM

Term rewriting; Term rewriting system; Term-rewriting; Rewrite system; Rewrite rule; Phase-structure rule; Rewriting system; Term Rewriting System; Reducible expression; Redex; Rewrite rules; Transformational rule; Rewriting logic; Term rewrite system; Reduction system; Substitution system; Reduction systems; Termination (term rewriting); Termination (rewriting); Trace rewriting system; Tree rewriting; Rewriter

$'''Pic.2:''' Rule lhs term <math>x*(y*z)</math> matching in term <math>\frac{a*((a+1)*(a+2))}{1*(2*3)}</math>$
$'''Pic.1:''' Schematic triangle diagram of application of a rewrite rule <math>l \longrightarrow r</math> at position <math>p</math> in a term, with matching substitution <math>\sigma</math>$

Найдено результатов: 11346

term rewriting system

(TRS) A collection of rewrite rules used to transform terms (expressions, strings in some formal language) into equivalent terms. See reduction. (1994-11-04)

Rewriting

In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines,

https://en.wikipedia.org/wiki/Rewriting

redex

Reducible Expression. An expression matching the left hand side of a reduction rule or definition.

Term (logic)

MATHEMATICAL EXPRESSION THAT MAY FORM A SEPARABLE PART OF AN EQUATION, A SERIES, OR ANOTHER EXPRESSION; USED IN IN MATHEMATICAL LOGIC, UNIVERSAL ALGEBRA, AND REWRITING SYSTEMS

Term (first-order logic); Logic term; Variant (logic); Term (term rewriting); Linear term; Context (term rewriting); Subterm; Finite terms; First-order terms; Subterms; Renamed copy

In mathematical logic, a term denotes a mathematical object while a formula denotes a mathematical fact. In particular, terms appear as components of a formula.

https://en.wikipedia.org/wiki/Term_(logic)

Semi-Thue system

HISTORICALLY CALLED A SEMI-THUE SYSTEM

String rewriting; String rewriting system; Semi-Thue grammar; Thue system; Word problem for semigroups; Semi-Thue problem; Semi-Thue

In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from a (usually finite) alphabet. Given a binary relation R between fixed strings over the alphabet, called rewrite rules, denoted by s\rightarrow t, an SRS extends the rewriting relation to all strings in which the left- and right-hand side of the rules appear as substrings, that is usv\rightarrow utv, where s, t, u, and v are strings.

https://en.wikipedia.org/wiki/Semi-Thue_system

graph rewriting system

TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH

Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting

An extension of a term rewriting system which uses {graph reduction} on terms represented by directed graphs to avoid duplication of work by sharing expressions.

Graph rewriting

TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH

Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation.

https://en.wikipedia.org/wiki/Graph_rewriting

Abstract rewriting machine

VIRTUAL MACHINE

Minimal term rewriting systems; Abstract Rewriting Machine

The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems.

https://en.wikipedia.org/wiki/Abstract_rewriting_machine

Nth-term test

TEST FOR THE DIVERGENCE OF AN INFINITE SERIES

Nth term test for divergence; Nth term test; Test for divergence; Test for Divergence; N-th term test; Nth term; Term test for divergence; Divergence term test; Term test

In mathematics, the nth-term test for divergenceKaczor p.336 is a simple test for the divergence of an infinite series:If \lim_{n \to \infty} a_n \neq 0 or if the limit does not exist, then \sum_{n=1}^\infty a_n diverges.

https://en.wikipedia.org/wiki/Nth-term_test

Long-term support

SOFTWARE VERSION THAT IS STABLE AND SUPPORTED UNDER A LONG-TERM OR EXTENDED CONTRACT

Long Term Support; Long term support; Extended support release; Extended-support release; Long-term stable; Long term stable

Long-term support (LTS) is a product lifecycle management policy in which a stable release of computer software is maintained for a longer period of time than the standard edition. The term is typically reserved for open-source software, where it describes a software edition that is supported for months or years longer than the software's standard edition.

https://en.wikipedia.org/wiki/Long-term_support

Википедия

Rewriting

In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, or reduction systems). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects.

Rewriting can be non-deterministic. One rule to rewrite a term could be applied in many different ways to that term, or more than one rule could be applicable. Rewriting systems then do not provide an algorithm for changing one term to another, but a set of possible rule applications. When combined with an appropriate algorithm, however, rewrite systems can be viewed as computer programs, and several theorem provers and declarative programming languages are based on term rewriting.

https://en.wikipedia.org/wiki/Rewriting